|
In mathematics, one method of defining a group is by an absolute presentation.〔B. Neumann, ''The isomorphism problem for algebraically closed groups,'' in: Word Problems, Decision Problems, and the Burnside Problem in Group Theory, Amsterdam-London (1973), pp. 553–562.〕 Recall that to define a group by means of a presentation, one specifies a set of generators so that every element of the group can be written as a product of some of these generators, and a set of relations among those generators. In symbols: : Informally is the group generated by the set such that for all . But here there is a tacit assumption that is the "freest" such group as clearly the relations are satisfied in any homomorphic image of . One way of being able to eliminate this tacit assumption is by specifying that certain words in should not be equal to That is we specify a set , called the set of irrelations, such that for all . ==Formal Definition== To define an absolute presentation of a group one specifies a set of generators, a set of relations among those generators and a set of irrelations among those generators. We then say has absolute presentation : provided that: # has presentation # Given any homomorphism such that the irrelations are satisfied in , is isomorphic to . A more algebraic, but equivalent, way of stating condition 2 is: :2a. if is a non-trivial normal subgroup of then Remark: The concept of an absolute presentation has been fruitful in fields such as algebraically closed groups and the Grigorchuk topology. In the literature, in a context where absolute presentations are being discussed, a presentation (in the usual sense of the word) is sometimes referred to as a relative presentation. The term seems rather strange as one may well ask "relative to what?" and the only justification seems to be that ''relative'' is habitually used as an antonym to ''absolute. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Absolute presentation of a group」の詳細全文を読む スポンサード リンク
|